Finding a Cluster of Zeros of Univariate Polynomials
نویسندگان
چکیده
منابع مشابه
Zeros of univariate interval polynomials
Polynomials with perturbed coefficients, which can be regarded as interval polynomials, are very common in the area of scientific computing due to floating point operations in a computer environment. In this paper, the zeros of interval polynomials are investigated. We show that, for a degree n interval polynomial, the number of interval zeros is at most n and the number of complex block zeros ...
متن کاملOn Bounds For The Zeros of Univariate Polynomials
Problems on algebraical polynomials appear in many fields of mathematics and computer science. Especially the task of determining the roots of polynomials has been frequently investigated. Nonetheless, the task of locating the zeros of complex polynomials is still challenging. In this paper we deal with the location of zeros of univariate complex polynomials. We prove some novel upper bounds fo...
متن کاملSome compact generalization of inequalities for polynomials with prescribed zeros
Let $p(z)=z^s h(z)$ where $h(z)$ is a polynomial of degree at most $n-s$ having all its zeros in $|z|geq k$ or in $|z|leq k$. In this paper we obtain some new results about the dependence of $|p(Rz)|$ on $|p(rz)| $ for $r^2leq rRleq k^2$, $k^2 leq rRleq R^2$ and for $Rleq r leq k$. Our results refine and generalize certain well-known polynomial inequalities.
متن کاملFinding the Zeros of a Univariate Equation: Proxy Rootfinders, Chebyshev Interpolation, and the Companion Matrix
When a function f(x) is holomorphic on an interval x ∈ [a, b], its roots on the interval can be computed by the following three-step procedure. First, approximate f(x) on [a, b] by a polynomial fN (x) using adaptive Chebyshev interpolation. Second, form the Chebyshev– Frobenius companion matrix whose elements are trivial functions of the Chebyshev coefficients of the interpolant fN (x). Third, ...
متن کاملComputing sharp and scalable bounds on errors in approximate zeros of univariate polynomials
There are several numerical methods for computing approximate zeros of a given univariate polynomial. In this paper, we develop a simple and novel method for determining sharp upper bounds on errors in approximate zeros of a given polynomial using Rouche's theorem from complex analysis. We compute the error bounds using non-linear optimization. Our bounds are scalable in the sense that we compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2000
ISSN: 0885-064X
DOI: 10.1006/jcom.2000.0555